Kriging based robust optimisation algorithm for minimax problems in electromagnetics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kriging based robust optimisation algorithm for minimax problems in electromagnetics

The paper discusses some of the recent advances in kriging based worst-case design optimisation and proposes a new two-stage approach to solve practical problems. The efficiency of the infill points allocation is improved significantly by adding an extra layer of optimisation enhanced by a validation process.

متن کامل

A minimax robust decoding algorithm

In this paper we study the decoding problem in an uncertain noise environment. If the receiver knows the noise probability density function (PDF) at each time slot or its a priori probability, the standard Viterbi algorithm VA or the a posteriori probability (APP) algorithm can achieve optimal performance. However, if the actual noise distribution diiers from the noise model used to design the ...

متن کامل

A Genetic Algorithm for Minimax Optimization Problems

Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...

متن کامل

An adaptive Kriging based optimisation algorithm for in- terval and fuzzy FRF analysis

The finite element method is a useful tool to predict the behaviour of a structure under static and dynamic loads. Reliable finite element analyses can reduce the need for prototype testing and reduce the design validation cost and time. In many real life situations however, a deterministic analysis is not sufficient to assess the quality of a design. In a design stage, some physical properties...

متن کامل

A minimax search algorithm for robust continuous speech recognition

In this paper, we propose a novel implementation of a minimax decision rule for continuous density hidden Markovmodel-based robust speech recognition. By combining the idea of the minimax decision rule with a normal Viterbi search, we derive a recursive minimax search algorithm, where the minimax decision rule is repetitively applied to determine the partial paths during the search procedure. B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archives of Electrical Engineering

سال: 2016

ISSN: 2300-2506

DOI: 10.1515/aee-2016-0059